. bi o - ph ] 1 3 A pr 2 00 5 Two complementary representations of a scale - free network

نویسندگان

  • J. C. Nacher
  • T. Yamada
  • S. Goto
  • M. Kanehisa
  • T. Akutsu
چکیده

Several studies on real complex networks from different fields as biology, economy , or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like P (k) ≈ k −γ , where P (k) denotes the frequency of the nodes that are connected to k other nodes. Here we have carried out a study on scale-free networks, where a line graph transformation (i.e., edges in an initial network are transformed into nodes) is applied to a power-law distribution. Our results indicate that a power-law distribution as P (k) ≈ k −γ+1 is found for the transformed network together with a peak for low-degree nodes. In the present work we show a parametrization of this behaviour and discuss its application to real networks as metabolic networks, protein-protein interaction network and World Wide Web.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

. bi o - ph ] 1 6 Fe b 20 04 Two complementary representations of a scale - free network

Several experimental studies on different fields as molecular biology, economy, or sociology have shown that real complex networks are following a power-law distribution like P (k) ≈ k −γ. However, many real networks hold two kind of nodes, being able to be projected as two embedded networks, e.g. movie-actor collaboration network (actors network and movies network), metabolic pathways (substra...

متن کامل

. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.

متن کامل

ar X iv : n lin / 0 00 40 13 v 1 [ nl in . S I ] 9 A pr 2 00 0 The critical A ( 1 ) n − 1 chain

(1) n−1 chain Abstract We study the A (1) n−1 spin chain at the critical regime |q| = 1. We give the free boson realizations of the type-I vertex operators and their duals. Using these free boson realizations, we give the integral representations for the correlation functions.

متن کامل

A pr 2 00 5 Modelling Linear Logic without Units ( Preliminary Results )

Proof nets for MLL, unit-free Multiplicative Linear Logic (Girard, 1987), provide elegant, abstract representations of proofs. Cut-free MLL proof nets form a category, under path composition, in the manner of EilenbergKelly-Mac Lane graphs (Eilenberg and Kelly, 1966; Kelly and Mac Lane, 1971). Objects are formulas of MLL, and a morphism A → B, a proof net from A to B, is a linking or matching b...

متن کامل

RTES-03 Interfaces.indd

[ B ur ns 20 07 ] B u rn s, A & W el lin gs , A C o n cu rr en t a n d R ea l-T im e Pr o gr am m in g in A d a, e d it io n C am b ri d ge U n iv er si ty P re ss 2 00 7 [ M o to ro la 19 96 ] M o to ro la Ti m e Pr o ce ss in g U n it R ef er en ce M an u al 1 99 6 p p . 1 -1 42 [ M o to ro la 20 00 ] M o to ro la M PC 56 5 & M PC 56 6 2 00 0 p p . 1 -1 31 2 [ P ea co ck 19 97 ] Pe ac o ck , ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005